Behaviour-Interaction-Priority in Functional Programming Languages Formalisation and Implementation of Concurrency Frameworks in Haskell and Scala

نویسنده

  • Romain Edelmann
چکیده

Acknowledgements First of all, I would like to thank my family. Without your endless support and care, this work would not have seen the light of day. Thank you for providing me with a very supportive environment! I would also like to thank Prof. Sifakis and Dr. Bliudze, with whom I had very insightful discussions. I would also like to thank them for giving me the opportunity to take part in the Research Scholar program at EPFL and work at the RiSD laboratory prior to this thesis. This whole experience has been very instructive to me. Obviously, this work would not have been possible without this great opportunity that was offered to me. Finally, I would like to thank my partner in life, Naomi, who had to put up with me throughout my studies at EPFL. Naomi, thank you very much for your patience, attention and love!

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functional BIP: Embedding connectors in functional programming languages

This paper presents a theoretical foundation for functional language implementations of BehaviourInteraction-Priority (BIP). We introduce a set of connector combinators describing synchronisation, data transfer, priorities and dynamicity in a principled way. A static type system ensures the soundness of connector semantics. Based on this foundation, we implemented BIP as an embedded domain spec...

متن کامل

Message–passing Implementation for Process Functional Language1

In this paper we introduce the concept an implementation of distributed programming in PFL – a process functional programming language and describe implementation of concurrency in other Haskell–like parallel functional languages – Concurrent Haskell and GpH. The process of writing parallel program is complicated by the need to specify both the parallel behaviour of the program and the algorith...

متن کامل

Four Concurrency Primitives for Haskell

A monad for concurrent programming that is suitable for being built into Haskell is presented. The monad consists of only four primitives with a very simple semantics. A number of examples demonstrate that monads encapsulating other, more sophisticated communication paradigms known from concurrent functional languages such as Concurrent ML, Facile, and Erlang can be naturally and systematically...

متن کامل

Comparing Haskell and Scala Support for Generic Programming

Datatype-generic programming involves parametrization of programs by the shape of data, in the form of type constructors such as ‘list of’. Most approaches to datatype-generic programming are developed in pure functional programming languages such as Haskell. We argue that the functional object-oriented language Scala is in many ways a better choice. Not only does Scala provide equivalents of a...

متن کامل

2 a Perspective on Interaction and Concurrency 2

A previous paper described the basic features of the new functional logic programming language Escher and provided example programs to illustrate those features. This paper continues the description of Escher by presenting its facilities for interaction and concurrency. A feature of these Escher facilities, which are based on the monadic approach of (Concurrent) Haskell, is their close integrat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015